On the Connectivity and the Diameter of Betweenness-Uniform Graphs

Betweenness centrality is a measure based on the overall amount of shortest paths passing through given vertex. A graph betweenness-uniform if all its vertices have same betweenness centrality. We study properties graphs. In particular, we show that every connected either cycle or 3-connected graph. Also, uniform graphs high maximal degree small diameter.